boltzmann machine work part3
How Boltzmann Machines work part3(Artificial Intelligence)
Abstract: Graph clustering is the process of grouping vertices into densely connected sets called clusters. In doing so, we obtain a heuristic approximation to the intra-cluster density maximization problem. We use two variations of a Boltzmann machine heuristic to obtain numerical solutions. For benchmarking purposes, we compare solution quality and computational performances to those obtained using a commercial solver, Gurobi. We also compare clustering quality to the clusters obtained using the popular Louvain modularity maximization method.